BRICS Basic Research in Computer Science BRICS RSJ. Groth: Extracting Witnesses from Proofs of Knowledge Extracting Witnesses from Proofs of

Source URL: www.brics.dk

• Cryptographic protocols
• Proof of knowledge
• Non-interactive zero-knowledge proof
• Interactive proof system
• IP
• Zero-knowledge proof
• NP
• Soundness
• Oracle machine
• Theoretical computer science
• Cryptography
• Computational complexity theory

Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

Source URL: doc.sagemath.org

• Operations research
• Dynamic programming
• Cryptography
• Combinatorial optimization
• Knapsack problem
• Subset sum problem
• Sequence
• Exponentiation
• Linear programming
• Mathematics
• Theoretical computer science
• Computational complexity theory

Measuring Empirical Computational Complexity Simon F. Goldsmith∗ Alex S. Aiken Computer Science Dept.

Source URL: dsw.users.sonic.net

BRICS RS-05-9 Frandsen & Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions BRICS Basic Research in Computer Science

Source URL: www.brics.dk

• Circuit complexity
• Complexity classes
• Mathematical notation
• Computational complexity theory
• Stack
• Boolean circuit
• Summation
• NC
• ACC0
• Theoretical computer science
• Mathematics
• Applied mathematics

BRICS Basic Research in Computer Science BRICS DS-97-3 T. Husfeldt: Dynamic Computation

Source URL: www.brics.dk

• Complexity classes
• Algorithm
• Mathematical logic
• Model of computation
• PP
• Dynamic problem
• P
• ACC0
• Circuit complexity
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems Carsten Lutz1 and Frank Wolter2 1 2

Source URL: www.informatik.uni-bremen.de

• Finite model theory
• Descriptive complexity
• Computational complexity theory
• FO
• Constraint programming
• Constraint satisfaction problem
• Conjunctive query
• SO
• HO
• Theoretical computer science
• Applied mathematics
• Complexity classes

SIAM J. COMPUT. Vol. 39, No. 7, pp. 3248–3282 c 2010 Society for Industrial and Applied Mathematics 

Source URL: www.cims.nyu.edu

• Applied mathematics
• Largest empty rectangle
• Geometry
• Exponentiation
• Open set
• Time complexity
• Mathematics
• Computational geometry
• Ε-net

Efficient Sensor Placement for Surveillance Problems⋆ Pankaj K. Agarwal, Esther Ezra, and Shashidhara Ganjugunte Dept. of Comp. Sci., Duke University, Durham, NCAbstract. We study the problem of covering a

Source URL: www.cims.nyu.edu

• Computational geometry
• Analysis of algorithms
• Ε-net
• Time complexity
• Art gallery problem
• Algorithm
• Randomized algorithm
• Sensor
• SL
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Theoretical Computer Science Master of Computer Science Study branches I1 Theoretical Computer Science I3 Mathematical Linguistics

Source URL: www.mff.cuni.cz

• Theoretical computer science
• Combinatorics
• Algorithm
• Discrete mathematics
• Computational complexity theory
• Mathematical optimization
• Linear programming
• Computer science
• Graph theory
• Operations research
• Applied mathematics
• Mathematics

Randomized Rumor Spreading R. Karp C. Schindelhauer Abstract

Source URL: archive.cone.informatik.uni-freiburg.de

• Cryptography
• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Algorithm
• Distributed computing
• PP
• Randomness
• Theoretical computer science
• Applied mathematics
• Computational complexity theory